The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).

(0) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(head(cons(X, XS))) → mark(X)
active(2nd(cons(X, XS))) → mark(head(XS))
active(take(0, XS)) → mark(nil)
active(take(s(N), cons(X, XS))) → mark(cons(X, take(N, XS)))
active(sel(0, cons(X, XS))) → mark(X)
active(sel(s(N), cons(X, XS))) → mark(sel(N, XS))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(2nd(X)) → 2nd(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
2nd(mark(X)) → mark(2nd(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(2nd(X)) → 2nd(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
2nd(ok(X)) → ok(2nd(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: INNERMOST

(1) NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID) transformation)

The following defined symbols can occur below the 0th argument of top: proper, active
The following defined symbols can occur below the 0th argument of proper: proper, active
The following defined symbols can occur below the 0th argument of active: proper, active

Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
active(from(X)) → mark(cons(X, from(s(X))))
active(head(cons(X, XS))) → mark(X)
active(2nd(cons(X, XS))) → mark(head(XS))
active(take(0, XS)) → mark(nil)
active(take(s(N), cons(X, XS))) → mark(cons(X, take(N, XS)))
active(sel(0, cons(X, XS))) → mark(X)
active(sel(s(N), cons(X, XS))) → mark(sel(N, XS))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(2nd(X)) → 2nd(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(2nd(X)) → 2nd(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))

(2) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

top(ok(X)) → top(active(X))
proper(nil) → ok(nil)
from(ok(X)) → ok(from(X))
from(mark(X)) → mark(from(X))
take(X1, mark(X2)) → mark(take(X1, X2))
head(ok(X)) → ok(head(X))
take(mark(X1), X2) → mark(take(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
2nd(mark(X)) → mark(2nd(X))
head(mark(X)) → mark(head(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
2nd(ok(X)) → ok(2nd(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
s(ok(X)) → ok(s(X))
s(mark(X)) → mark(s(X))
proper(0) → ok(0)
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
top(mark(X)) → top(proper(X))

Rewrite Strategy: INNERMOST

(3) CpxTrsMatchBoundsTAProof (EQUIVALENT transformation)

A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2.

The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by:
final states : [1, 2, 3, 4, 5, 6, 7, 8, 9]
transitions:
ok0(0) → 0
active0(0) → 0
nil0() → 0
mark0(0) → 0
00() → 0
top0(0) → 1
proper0(0) → 2
from0(0) → 3
take0(0, 0) → 4
head0(0) → 5
cons0(0, 0) → 6
2nd0(0) → 7
sel0(0, 0) → 8
s0(0) → 9
active1(0) → 10
top1(10) → 1
nil1() → 11
ok1(11) → 2
from1(0) → 12
ok1(12) → 3
from1(0) → 13
mark1(13) → 3
take1(0, 0) → 14
mark1(14) → 4
head1(0) → 15
ok1(15) → 5
cons1(0, 0) → 16
ok1(16) → 6
2nd1(0) → 17
mark1(17) → 7
head1(0) → 18
mark1(18) → 5
sel1(0, 0) → 19
mark1(19) → 8
2nd1(0) → 20
ok1(20) → 7
take1(0, 0) → 21
ok1(21) → 4
s1(0) → 22
ok1(22) → 9
s1(0) → 23
mark1(23) → 9
01() → 24
ok1(24) → 2
sel1(0, 0) → 25
ok1(25) → 8
cons1(0, 0) → 26
mark1(26) → 6
proper1(0) → 27
top1(27) → 1
ok1(11) → 27
ok1(12) → 12
ok1(12) → 13
mark1(13) → 12
mark1(13) → 13
mark1(14) → 14
mark1(14) → 21
ok1(15) → 15
ok1(15) → 18
ok1(16) → 16
ok1(16) → 26
mark1(17) → 17
mark1(17) → 20
mark1(18) → 15
mark1(18) → 18
mark1(19) → 19
mark1(19) → 25
ok1(20) → 17
ok1(20) → 20
ok1(21) → 14
ok1(21) → 21
ok1(22) → 22
ok1(22) → 23
mark1(23) → 22
mark1(23) → 23
ok1(24) → 27
ok1(25) → 19
ok1(25) → 25
mark1(26) → 16
mark1(26) → 26
active2(11) → 28
top2(28) → 1
active2(24) → 28

(4) BOUNDS(1, n^1)

(5) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted Cpx (relative) TRS to CDT

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
proper(nil) → ok(nil)
proper(0) → ok(0)
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
take(z0, mark(z1)) → mark(take(z0, z1))
take(mark(z0), z1) → mark(take(z0, z1))
take(ok(z0), ok(z1)) → ok(take(z0, z1))
head(ok(z0)) → ok(head(z0))
head(mark(z0)) → mark(head(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
2nd(mark(z0)) → mark(2nd(z0))
2nd(ok(z0)) → ok(2nd(z0))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))

Tuples:

TOP(ok(z0)) → c(TOP(active(z0)))
TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
PROPER(nil) → c2
PROPER(0) → c3
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))

S tuples:

TOP(ok(z0)) → c(TOP(active(z0)))
TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
PROPER(nil) → c2
PROPER(0) → c3
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))

K tuples:none
Defined Rule Symbols:

top, proper, from, take, head, cons, 2nd, sel, s

Defined Pair Symbols:

TOP, PROPER, FROM, TAKE, HEAD, CONS, 2ND, SEL, S

Compound Symbols:

c, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19

(7) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)

Removed 3 trailing nodes:

PROPER(0) → c3
PROPER(nil) → c2
TOP(ok(z0)) → c(TOP(active(z0)))

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
proper(nil) → ok(nil)
proper(0) → ok(0)
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
take(z0, mark(z1)) → mark(take(z0, z1))
take(mark(z0), z1) → mark(take(z0, z1))
take(ok(z0), ok(z1)) → ok(take(z0, z1))
head(ok(z0)) → ok(head(z0))
head(mark(z0)) → mark(head(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
2nd(mark(z0)) → mark(2nd(z0))
2nd(ok(z0)) → ok(2nd(z0))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))

Tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))

S tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))

K tuples:none
Defined Rule Symbols:

top, proper, from, take, head, cons, 2nd, sel, s

Defined Pair Symbols:

TOP, FROM, TAKE, HEAD, CONS, 2ND, SEL, S

Compound Symbols:

c1, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19

(9) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)

Removed 1 trailing tuple parts

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
proper(nil) → ok(nil)
proper(0) → ok(0)
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
take(z0, mark(z1)) → mark(take(z0, z1))
take(mark(z0), z1) → mark(take(z0, z1))
take(ok(z0), ok(z1)) → ok(take(z0, z1))
head(ok(z0)) → ok(head(z0))
head(mark(z0)) → mark(head(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
2nd(mark(z0)) → mark(2nd(z0))
2nd(ok(z0)) → ok(2nd(z0))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

K tuples:none
Defined Rule Symbols:

top, proper, from, take, head, cons, 2nd, sel, s

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(11) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
take(z0, mark(z1)) → mark(take(z0, z1))
take(mark(z0), z1) → mark(take(z0, z1))
take(ok(z0), ok(z1)) → ok(take(z0, z1))
head(ok(z0)) → ok(head(z0))
head(mark(z0)) → mark(head(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
2nd(mark(z0)) → mark(2nd(z0))
2nd(ok(z0)) → ok(2nd(z0))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

K tuples:none
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(13) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

TOP(mark(z0)) → c1(TOP(proper(z0)))

We considered the (Usable) Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(2ND(x₁)) = 0   
POL(CONS(x₁, x₂)) = 0   
POL(FROM(x₁)) = 0   
POL(HEAD(x₁)) = 0   
POL(S(x₁)) = 0   
POL(SEL(x₁, x₂)) = 0   
POL(TAKE(x₁, x₂)) = 0   
POL(TOP(x₁)) = x₁   
POL(c1(x₁)) = x₁   
POL(c10(x₁)) = x₁   
POL(c11(x₁)) = x₁   
POL(c12(x₁)) = x₁   
POL(c13(x₁)) = x₁   
POL(c14(x₁)) = x₁   
POL(c15(x₁)) = x₁   
POL(c16(x₁)) = x₁   
POL(c17(x₁)) = x₁   
POL(c18(x₁)) = x₁   
POL(c19(x₁)) = x₁   
POL(c4(x₁)) = x₁   
POL(c5(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c7(x₁)) = x₁   
POL(c8(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(mark(x₁)) = [1] + x₁   
POL(nil) = 0   
POL(ok(x₁)) = 0   
POL(proper(x₁)) = 0   

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))

K tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)))

Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(15) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
SEL(mark(z0), z1) → c15(SEL(z0, z1))

We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(2ND(x₁)) = 0   
POL(CONS(x₁, x₂)) = x₁   
POL(FROM(x₁)) = x₁   
POL(HEAD(x₁)) = 0   
POL(S(x₁)) = 0   
POL(SEL(x₁, x₂)) = x₁   
POL(TAKE(x₁, x₂)) = x₁ + x₂   
POL(TOP(x₁)) = 0   
POL(c1(x₁)) = x₁   
POL(c10(x₁)) = x₁   
POL(c11(x₁)) = x₁   
POL(c12(x₁)) = x₁   
POL(c13(x₁)) = x₁   
POL(c14(x₁)) = x₁   
POL(c15(x₁)) = x₁   
POL(c16(x₁)) = x₁   
POL(c17(x₁)) = x₁   
POL(c18(x₁)) = x₁   
POL(c19(x₁)) = x₁   
POL(c4(x₁)) = x₁   
POL(c5(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c7(x₁)) = x₁   
POL(c8(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(mark(x₁)) = [1] + x₁   
POL(nil) = 0   
POL(ok(x₁)) = x₁   
POL(proper(x₁)) = [1]   

(16) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

FROM(ok(z0)) → c4(FROM(z0))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))

K tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
SEL(mark(z0), z1) → c15(SEL(z0, z1))

Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(17) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))

We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [1]   
POL(2ND(x₁)) = x₁   
POL(CONS(x₁, x₂)) = 0   
POL(FROM(x₁)) = 0   
POL(HEAD(x₁)) = x₁   
POL(S(x₁)) = 0   
POL(SEL(x₁, x₂)) = x₂   
POL(TAKE(x₁, x₂)) = 0   
POL(TOP(x₁)) = 0   
POL(c1(x₁)) = x₁   
POL(c10(x₁)) = x₁   
POL(c11(x₁)) = x₁   
POL(c12(x₁)) = x₁   
POL(c13(x₁)) = x₁   
POL(c14(x₁)) = x₁   
POL(c15(x₁)) = x₁   
POL(c16(x₁)) = x₁   
POL(c17(x₁)) = x₁   
POL(c18(x₁)) = x₁   
POL(c19(x₁)) = x₁   
POL(c4(x₁)) = x₁   
POL(c5(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c7(x₁)) = x₁   
POL(c8(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(mark(x₁)) = [1] + x₁   
POL(nil) = [1]   
POL(ok(x₁)) = [1] + x₁   
POL(proper(x₁)) = [1] + x₁   

(18) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

FROM(ok(z0)) → c4(FROM(z0))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))

K tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))

Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(19) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

S(mark(z0)) → c19(S(z0))

We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(2ND(x₁)) = 0   
POL(CONS(x₁, x₂)) = 0   
POL(FROM(x₁)) = 0   
POL(HEAD(x₁)) = 0   
POL(S(x₁)) = x₁   
POL(SEL(x₁, x₂)) = x₂   
POL(TAKE(x₁, x₂)) = 0   
POL(TOP(x₁)) = 0   
POL(c1(x₁)) = x₁   
POL(c10(x₁)) = x₁   
POL(c11(x₁)) = x₁   
POL(c12(x₁)) = x₁   
POL(c13(x₁)) = x₁   
POL(c14(x₁)) = x₁   
POL(c15(x₁)) = x₁   
POL(c16(x₁)) = x₁   
POL(c17(x₁)) = x₁   
POL(c18(x₁)) = x₁   
POL(c19(x₁)) = x₁   
POL(c4(x₁)) = x₁   
POL(c5(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c7(x₁)) = x₁   
POL(c8(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(mark(x₁)) = [1] + x₁   
POL(nil) = 0   
POL(ok(x₁)) = x₁   
POL(proper(x₁)) = 0   

(20) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

FROM(ok(z0)) → c4(FROM(z0))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
S(ok(z0)) → c18(S(z0))

K tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(mark(z0)) → c19(S(z0))

Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(21) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))

We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(2ND(x₁)) = 0   
POL(CONS(x₁, x₂)) = 0   
POL(FROM(x₁)) = 0   
POL(HEAD(x₁)) = 0   
POL(S(x₁)) = 0   
POL(SEL(x₁, x₂)) = [2]x₂   
POL(TAKE(x₁, x₂)) = x₁ + x₂   
POL(TOP(x₁)) = 0   
POL(c1(x₁)) = x₁   
POL(c10(x₁)) = x₁   
POL(c11(x₁)) = x₁   
POL(c12(x₁)) = x₁   
POL(c13(x₁)) = x₁   
POL(c14(x₁)) = x₁   
POL(c15(x₁)) = x₁   
POL(c16(x₁)) = x₁   
POL(c17(x₁)) = x₁   
POL(c18(x₁)) = x₁   
POL(c19(x₁)) = x₁   
POL(c4(x₁)) = x₁   
POL(c5(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c7(x₁)) = x₁   
POL(c8(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(mark(x₁)) = x₁   
POL(nil) = 0   
POL(ok(x₁)) = [1] + x₁   
POL(proper(x₁)) = 0   

(22) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

FROM(ok(z0)) → c4(FROM(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
S(ok(z0)) → c18(S(z0))

K tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(mark(z0)) → c19(S(z0))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))

Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(23) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

FROM(ok(z0)) → c4(FROM(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))

We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(2ND(x₁)) = 0   
POL(CONS(x₁, x₂)) = x₁   
POL(FROM(x₁)) = x₁   
POL(HEAD(x₁)) = 0   
POL(S(x₁)) = 0   
POL(SEL(x₁, x₂)) = 0   
POL(TAKE(x₁, x₂)) = 0   
POL(TOP(x₁)) = 0   
POL(c1(x₁)) = x₁   
POL(c10(x₁)) = x₁   
POL(c11(x₁)) = x₁   
POL(c12(x₁)) = x₁   
POL(c13(x₁)) = x₁   
POL(c14(x₁)) = x₁   
POL(c15(x₁)) = x₁   
POL(c16(x₁)) = x₁   
POL(c17(x₁)) = x₁   
POL(c18(x₁)) = x₁   
POL(c19(x₁)) = x₁   
POL(c4(x₁)) = x₁   
POL(c5(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c7(x₁)) = x₁   
POL(c8(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(mark(x₁)) = x₁   
POL(nil) = 0   
POL(ok(x₁)) = [1] + x₁   
POL(proper(x₁)) = 0   

(24) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:

S(ok(z0)) → c18(S(z0))

K tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(mark(z0)) → c19(S(z0))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
FROM(ok(z0)) → c4(FROM(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))

Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(25) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

S(ok(z0)) → c18(S(z0))

We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(2ND(x₁)) = 0   
POL(CONS(x₁, x₂)) = 0   
POL(FROM(x₁)) = 0   
POL(HEAD(x₁)) = 0   
POL(S(x₁)) = x₁   
POL(SEL(x₁, x₂)) = 0   
POL(TAKE(x₁, x₂)) = 0   
POL(TOP(x₁)) = 0   
POL(c1(x₁)) = x₁   
POL(c10(x₁)) = x₁   
POL(c11(x₁)) = x₁   
POL(c12(x₁)) = x₁   
POL(c13(x₁)) = x₁   
POL(c14(x₁)) = x₁   
POL(c15(x₁)) = x₁   
POL(c16(x₁)) = x₁   
POL(c17(x₁)) = x₁   
POL(c18(x₁)) = x₁   
POL(c19(x₁)) = x₁   
POL(c4(x₁)) = x₁   
POL(c5(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c7(x₁)) = x₁   
POL(c8(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(mark(x₁)) = x₁   
POL(nil) = 0   
POL(ok(x₁)) = [2] + x₁   
POL(proper(x₁)) = 0   

(26) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)

Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(ok(z0)) → c18(S(z0))
S(mark(z0)) → c19(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))

S tuples:none
K tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)))
FROM(mark(z0)) → c5(FROM(z0))
TAKE(z0, mark(z1)) → c6(TAKE(z0, z1))
TAKE(mark(z0), z1) → c7(TAKE(z0, z1))
CONS(mark(z0), z1) → c12(CONS(z0, z1))
SEL(mark(z0), z1) → c15(SEL(z0, z1))
HEAD(ok(z0)) → c9(HEAD(z0))
HEAD(mark(z0)) → c10(HEAD(z0))
2ND(mark(z0)) → c13(2ND(z0))
2ND(ok(z0)) → c14(2ND(z0))
SEL(ok(z0), ok(z1)) → c16(SEL(z0, z1))
SEL(z0, mark(z1)) → c17(SEL(z0, z1))
S(mark(z0)) → c19(S(z0))
TAKE(ok(z0), ok(z1)) → c8(TAKE(z0, z1))
FROM(ok(z0)) → c4(FROM(z0))
CONS(ok(z0), ok(z1)) → c11(CONS(z0, z1))
S(ok(z0)) → c18(S(z0))

Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, TAKE, HEAD, CONS, 2ND, SEL, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c1

(27) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty

(28) BOUNDS(1, 1)